Logical Learning Through a Hybrid Neural Network with Auxiliary Inputs

The human reasoning process is seldom a one-way process from an input leading to an output. Instead, it often involves a systematic deduction by ruling out other possible outcomes as a self-checking mechanism. In this paper, we describe the design of a hybrid neural network for logical learning that is similar to the human reasoning through the introduction of an auxiliary input, namely the indicators, that act as the hints to suggest logical outcomes. We generate these indicators by digging into the hidden information buried underneath the original training data for direct or indirect suggestions. We used the MNIST data to demonstrate the design and use of these indicators in a convolutional neural network. We trained a series of such hybrid neural networks with variations of the indicators. Our results show that these hybrid neural networks are very robust in generating logical outcomes with inherently higher prediction accuracy than the direct use of the original input and output in apparent models. Such improved predictability with reassured logical confidence is obtained through the exhaustion of all possible indicators to rule out all illogical outcomes, which is not available in the apparent models. Our logical learning process can effectively cope with the unknown unknowns using a full exploitation of all existing knowledge available for learning. The design and implementation of the hints, namely the indicators, become an essential part of artificial intelligence for logical learning. We also introduce an ongoing application setup for this hybrid neural network in an autonomous grasping robot, namely as_DeepClaw, aiming at learning an optimized grasping pose through logical learning.Comment: 11 pages, 9 figures, 4 table

Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model

Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature on a message for which the adversary has seen valid signatures before. Strongly unforgeable signatures are useful both in practice and as a building block in many cryptographic constructions. This work investigates a generic transformation that compiles any existential-unforgeable scheme into a strongly unforgeable one, which was proposed by Teranishi et al. and was proven in the classical random-oracle model. Our main contribution is showing that the transformation also works against quantum adversaries in the quantum random-oracle model. We develop proof techniques such as adaptively programming a quantum random-oracle in a new setting, which could be of independent interest. Applying the transformation to an existential-unforgeable signature scheme due to Cash et al., which can be shown to be quantum-secure assuming certain lattice problems are hard for quantum computers, we get an efficient quantum-secure strongly unforgeable signature scheme in the quantum random-oracle model.Comment: 15 pages, to appear in Proceedings TQC 201

Real-space recipes for general topological crystalline states

Topological crystalline states are short-range entangled states jointly protected by onsite and crystalline symmetries. While the non-interacting limit of these states, e.g., the topological crystalline insulators, have been intensively studied in band theory and have been experimentally discovered, the classification and diagnosis of their strongly interacting counterparts are relatively less well understood. Here we present a unified scheme for constructing all topological crystalline states, bosonic and fermionic, free and interacting, from real-space "building blocks" and "connectors". Building blocks are finite-size pieces of lower dimensional topological states protected by onsite symmetries alone, and connectors are "glue" that complete the open edges shared by two or multiple pieces of building blocks. The resulted assemblies are selected against two physical criteria we call the "no-open-edge condition" and the "bubble equivalence", which, respectively, ensure that each selected assembly is gapped in the bulk and cannot be deformed to a product state. The scheme is then applied to obtaining the full classification of bosonic topological crystalline states protected by several onsite symmetry groups and each of the 17 wallpaper groups in two dimensions and 230 space groups in three dimensions. We claim that our real-space recipes give the complete set of topological crystalline states for bosons and fermions, and prove the boson case analytically using a spectral sequence expansion of group cohomology.Comment: 17+44 pages, 7+1 figures, 0+2 tables. The content is the same as the published version, but arranged differentl

Classical Cryptographic Protocols in a Quantum World

Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information processing is the most realistic model of physically feasible computation, then we must ask: what classical protocols remain secure against quantum attackers? Our main contribution is showing the existence of classical two-party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions (for example, it suffices that the learning with errors problem be hard for quantum polynomial time). Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.Comment: Full version of an old paper in Crypto'11. Invited to IJQI. This is authors' copy with different formattin

Diagnosis for topological semimetals in the absence of spin-orbital coupling

Topological semimetals are under intensive theoretical and experimental studies. The first step of these studies is always the theoretical (numerical) predication of one of several candidate materials, starting from first principles. In these calculations, it is crucial that all topological band crossings, including their types and positions in the Brillouin zone, are found. While band crossings along high-symmetry lines, which are routinely scanned in numerics, are simple to locate, the ones at generic momenta are notoriously time-consuming to find, and may be easily missed. In this paper, we establish a theoretical scheme of diagnosis for topological semimetals where all band crossings are at generic momenta in systems with time-reversal symmetry and negligible spin-orbital coupling. The scheme only uses the symmetry (inversion and rotation) eigenvalues of the valence bands at high-symmetry points in the BZ as input, and provides the types, numbers and configurations of all topological band crossings, if any, at generic momenta. The nature of new diagnosis scheme allows for full automation and parallelizations, and paves way to high throughput numerical predictions of topological materials.Comment: 21 pages, 5 figures, 1 table; v4: accepted in PRX, a "PRELIMINARIES" section adde